Deep Hashing with Hash-Consistent Large Margin Proxy Embeddings
نویسندگان
چکیده
منابع مشابه
Proxy Caching with Hash Functions
Internet traffic doubles every three months, with web traffic accounting for more than 75% of the total traffic between major ISP providers. Web caching at proxies can reduce this traffic as well as web user latencies. One way to increase the hit rate of caches is to have caches cooperate using the Internet Cache Protocol or using hash functions. This paper provides an experimental and theoreti...
متن کاملConsistent Hashing with Bounded Loads
Designing algorithms for balanced allocation of clients to servers in dynamic settings is a challenging problem for a variety of reasons. We want a hashing-style solution where we given the ID of a client can efficiently find its server in a distributed dynamic environment where both servers and clients may be added and/or removed from the system in any order. The main objectives of allocation ...
متن کاملWeb Caching with Consistent Hashing
A key performance measure for the World Wide Web is the speed with which content is served to users. As traffic on the Web increases, users are faced with increasing delays and failures in data delivery. Web caching is one of the key strategies that has been explored to improve performance. An important issue in many caching systems is how to decide what is cached where at any given time. Solut...
متن کاملLarge Margin Deep Networks for Classification
We present a formulation of deep learning that aims at producing a large margin classifier. The notion of margin, minimum distance to a decision boundary, has served as the foundation of several theoretically profound and empirically successful results for both classification and regression tasks. However, most large margin algorithms are applicable only to shallow models with a preset feature ...
متن کاملEfficient data hashing with structured binary embeddings
We present here new mechanisms for hashing data via binary embeddings. Contrary to most of the techniques presented before, the embedding matrix of our mechanism is highly structured. That enables us to perform hashing more efficiently and use less memory. What is crucial and nonintuitive is the fact that imposing structured mechanism does not affect the quality of the produced hash. To the bes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2020
ISSN: 0920-5691,1573-1405
DOI: 10.1007/s11263-020-01362-7